On the Embedding of a Class of Regular Graphs in a Faulty Hypercube
نویسندگان
چکیده
A wide range of graphs with regular structures are shown to be embeddable in an injured hypercube with faulty links. These include rings, linear paths, binomial trees, binary trees, meshes, tori, and many others. Unlike many existing algorithms which are capable of embedding only one type of graphs, our algorithm embeds the above graphs in a uniied way, all centered around a notion called edge matrix. In many cases, the degree of fault tolerance ooered by the algorithm is optimal or near-optimal.
منابع مشابه
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
AbstructWe consider the problem of embedding a cubeconnected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a l i t of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because...
متن کاملReconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes
The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansio...
متن کاملDistributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...
متن کاملFault-Tolerant Cycle Embedding in Restricted Hypercube-like Networks with More Faulty Nodes
The hypercube-like networks are a class of important generalization of the popular hypercube interconnection networks for parallel computing. This paper is concerned with the fault-tolerant cycle embedding ability of a subclass of hypercube-like networks, called restricted hypercube-like networks (RHLNs, for short), which include most of the well-known hypercube variants, such as the twisted cu...
متن کاملOptimal Simulation of Full Binary Trees on Faulty Hypercubes
Abs-t-We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1)-tree (a full binary tree with 2"-l-1 nodes) into an n-cube (a hypercube with 2" nodes) with unit dilat...
متن کامل